Comparison between Standard K-Mean Clustering and Improved K-Mean Clustering
نویسندگان
چکیده
منابع مشابه
Comparison between Standard K-Mean Clustering and Improved K-Mean Clustering
Clustering in data mining is very important to discover distribution patterns and this importance tends to increase as the amount of data grows. It is one of the main analytical methods in data mining and its method influences its results directly. K-means is a typical clustering algorithm[3]. It mainly consists of two phases i.e. initializing random clusters and to find the nearest neighbour. ...
متن کاملImproved K-mean clustering with Mobile Agent
The data stream model has recently attracted attention for its applicability to numerous types of data, including telephone records, Web documents, and click streams. For analysis of such data, the ability to process the data in a single pass, or a small number of passes, while using little memory, is crucial. D-Stream algorithm is an extended grid-based clustering algorithm for different dimen...
متن کاملImage Retrieval using Canopy and Improved K mean Clustering
In a typical content based image retrieval (CBIR) system, target images are sorted by feature similarities with respect to the query. These methods fail to capture similarities among target images and user feedback. To overcome this problem existing methods combine relevance feedback and clustering. But clustering requires more number of expensive distance calculations. To remedy this problem w...
متن کاملK-mean Based Clustering and Context Quantization
In this thesis, we study the problems of K-means clustering and context quantization. The main task of K-means clustering is to partition the training patterns into k distinct groups or clusters that minimize the mean-square-error (MSE) objective function. But the main difficulty of conventional K-means clustering is that its classification performance is highly susceptible to the initialized s...
متن کاملK-Mean Clustering and PSO: A Review
Clustering is a method which divides data objects into groups based on the information found in data that describes the objects and relationships among them. There are a variety of algorithms have been developed in recent years for solving problems of data clustering. Data clustering algorithms can be either hierarchical or partitioned. Most promising among them are K-means algorithm which is p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2016
ISSN: 0975-8887
DOI: 10.5120/ijca2016910868